On Transitory Queueing
نویسندگان
چکیده
We introduce a framework and develop a theory of ‘transitory’ queueing models. These are models that are not only non-stationary and time-varying but also have other features such as the queueing system operates over finite time, or only a finite population arrives. Such models are relevant in many real-world settings, from queues at post-offices, DMV, concert halls and stadia to out-patient departments at hospitals. We develop fluid and diffusion limits for a large class of ‘transitory’ queueing models. We then introduce three specific models that fit within this framework, namely, the ∆(i)/GI/1 model, the conditioned G/GI/1 model, and an arrival model of scheduled traffic with epoch uncertainty. We show that asymptotically these models are distributionally equivalent, i.e., they have the same fluid and diffusion limits. We note that our framework provides the first ever way of analyzing the standard G/GI/1 model when we condition on the number of arrivals. In obtaining these results, we provide generalizations and extensions of the Glivenko-Cantelli and Donsker’s Theorems to triangular arrays. Our analysis uses a technique we call population acceleration, which we discuss in some detail.
منابع مشابه
Rare events of transitory queues
We study the rare event behavior of the workload process in a transitory queue, where the arrival epochs (or ‘points’) of a finite number of jobs are assumed to be the ordered statistics of independent and identically distributed (i.i.d.) random variables. The service times (or ‘marks’) of the jobs are assumed to be i.i.d. random variables with a general distribution, that are jointly independe...
متن کاملTransitory Queueing Networks
Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print ...
متن کاملA New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System
We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...
متن کاملFads Models with Markov Switching Hetroskedasticity: decomposing Tehran Stock Exchange return into Permanent and Transitory Components
Stochastic behavior of stock returns is very important for investors and policy makers in the stock market. In this paper, the stochastic behavior of the return index of Tehran Stock Exchange (TEDPIX) is examined using unobserved component Markov switching model (UC-MS) for the 3/27/2010 until 8/3/2015 period. In this model, stock returns are decomposed into two components; a permanent componen...
متن کاملAnalysis of M/G/ 1 queueing model with state dependent arrival and vacation
This investigation deals with single server queueing system wherein the arrival of the units follow Poisson process with varying arrival rates in different states and the service time of the units is arbitrary (general) distributed. The server may take a vacation of a fixed duration or may continue to be available in the system for next service. Using the probability argument, we construct the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1412.2321 شماره
صفحات -
تاریخ انتشار 2013